• OpenAccess
    • List of Articles Routing

      • Open Access Article

        1 - using clustering in AODV routing protocol for vehicular ad-hoc networks on highway scenario
        amin feyzi
        Vehicular Ad hoc networks are a subset of mobile Ad hoc networks in which vehicles are considered as network nodes. Their major difference is rapid mobility of nodes which causes the quick change of topology in this network. Quick changes in the topology of the network More
        Vehicular Ad hoc networks are a subset of mobile Ad hoc networks in which vehicles are considered as network nodes. Their major difference is rapid mobility of nodes which causes the quick change of topology in this network. Quick changes in the topology of the network are considered as a big challenge For routing in these networks, routing protocols must be robust and reliable. AODV Routing protocol is one of the known routing protocols in vehicular ad hoc networks. There are also some problems in applying this routing protocol on the vehicular ad hoc networks. The number of control massages increases with increasing the scale of the network and the number of nodes . One way to reduce the overhead in AODV routing protocol is clustering the nodes of the network. In this paper , the modified K-means algorithm has been used for clustering the nodes and particle swarm optimization has been used for selecting cluster head. The results of the proposed method improved normalized routing load and the increase of the packet delivery rate compared to AODV routing protocol. Manuscript profile
      • Open Access Article

        2 - Multicast computer network routing using genetic algorithm and ant colony
        Mohammad Pourmahmood Aghababa
        Due to the growth and development of computer networks, the importance of the routing topic has been increased. The importance of the use of multicast networks is not negligible nowadays. Many of multimedia programs need to use a communication link to send a packet from More
        Due to the growth and development of computer networks, the importance of the routing topic has been increased. The importance of the use of multicast networks is not negligible nowadays. Many of multimedia programs need to use a communication link to send a packet from a sender to several receivers. To support such programs, there is a need to make an optimal multicast tree to indicate the optimal routes from the sending source to the corresponding sinks.  Providing an optimal tree for routing is a complicated problem. In this paper, we are looking forward a method for routing of multicast networks with considering some parameters such as the cost and delay. Also, this paper has emphasized the issue that every parameter in routing problem has different value for different packets. And in accordance to these parameters optimal routing multicast trees are proposed. To gain this end, the genetic algorithm and ant colony optimization approaches are adopted. The simulation results show that the presented algorithms are able to produce optimal multicast trees subject to the packets. Manuscript profile
      • Open Access Article

        3 - Routing of Multipartite Computer Networks Using Ant Genetic Algorithm
        Mohammad Pourmahmood Aghababa amin bahadorani baghbaderani
        With the growth and development of computer networks, the importance of routing has become a thing of the past. The importance of using multi-sectoral networks cannot be ignored today. Many multimedia applications require sending a packet from one source to multiple des More
        With the growth and development of computer networks, the importance of routing has become a thing of the past. The importance of using multi-sectoral networks cannot be ignored today. Many multimedia applications require sending a packet from one source to multiple destinations over a communication network. To support such programs, you need to create an optimal multipart tree , Which indicates the optimal routes to reach from one sender source to several desired destinations. Manuscript profile
      • Open Access Article

        4 - Application of clustering in AODV routing protocol for intercity networks on the highway scenario
        amin feyzi Vahid Sattari-Naeini majid mohammadi
        Intercarous networks are a subset of mobile networks in which vehicles are considered as network nodes. The main difference with case mobile networks is the rapid mobility of nodes, which causes rapid topology change in this network It becomes. Rapid changes in network More
        Intercarous networks are a subset of mobile networks in which vehicles are considered as network nodes. The main difference with case mobile networks is the rapid mobility of nodes, which causes rapid topology change in this network It becomes. Rapid changes in network topology are a major challenge for routing, for routing in these networks, routing protocols must be robust and reliable. One of the well-known routing protocols in intercity networks is the AODV routing protocol. The application of this routing protocol on intercity networks also has problems that increase the number of control messages in the network by increasing the scale of the network and the number of nodes. One way to reduce overhead in the AODV protocol is to cluster network nodes. In this paper, the modified K-Means algorithm is used to cluster the nodes and the particle swarm algorithm is used to select the cluster head. The results of the proposed method improve the normal routing load and increase the packet delivery rate compared to the AODV routing protocol. Manuscript profile
      • Open Access Article

        5 - A RPL-based Routing Algorithm for Multimedia Traffic for the Internet of Things
        Mohammad Khansari Farzaneh Mortazavi
        According to enormous growths in communication networks, multimedia data will play a significant role on the Internet of Things in the near future. High volume of multimedia data leads to challenges such as reducing network lifetime and congestion. In this paper, a new More
        According to enormous growths in communication networks, multimedia data will play a significant role on the Internet of Things in the near future. High volume of multimedia data leads to challenges such as reducing network lifetime and congestion. In this paper, a new objective function for the RPL routing protocol is proposed which addresses the characteristics of multimedia data in the routing process. In the objective function, node’s remaining energy and the remaining buffer capacity of nodes measures are combined using a weighted pair. In order to evaluate this method, input data is generated based on a video trace. Packet delivery ratio, network lifetime, nodes availability over the lifetime of the network, node energy distribution, and end-to-end delay are used to evaluate the proposed method. The evaluation results show that the proposed method increases the package delivery ratio compared to the standard RPL. This method also improves the lifetime of the nodes by distributing energy between the nodes in comparison with standard RPL and extends the node's availability over the lifetime of the network. Finally, it reduces the network congestion which led to a lower end-to-end delay. Manuscript profile
      • Open Access Article

        6 - An Individual-Oriented Shuffled Frog Leaping Algorithm for Solving Vehicle Routing Problem
        Soheila Shafiezadeh Zahra Beheshti
        The Vehicle Routing Problem (VRP) is one of the most important problems in supply chain management because the optimal allocation of vehicles has a significant impact on reducing costs. VRP is in the class of NP-hard problems and exact algorithms cannot find the best so More
        The Vehicle Routing Problem (VRP) is one of the most important problems in supply chain management because the optimal allocation of vehicles has a significant impact on reducing costs. VRP is in the class of NP-hard problems and exact algorithms cannot find the best solution in an acceptable time. Hence, meta-heuristic algorithms can be employed to solve it. Shuffled Frog Leaping Algorithm (SFLA) is one of the meta-heuristic algorithms, which is efficient, but in some cases, its population diversity rapidly reduces, and the algorithm falls in local optima. In this study, an Individual-Oriented Shuffled Frog Leaping Algorithm (IO-SFLA) is proposed to enhance the exploration and exploitation of SFLA by exchanging the global and local information. Several VRPs in different dimensions are applied to evaluate the performance of IO-SFLA. The efficiency of IO-SFLA is compared with several improved shuffled frog leaping algorithms, Simulated Annealing (SA) and Genetic Algorithm (GA). The results show that IO-SFLA provides significant results compared with the other competitor algorithms. IO-SFLA achieves an average of 1130.442 for the best path cost. The next rank belongs to SA with an average of 1228.725. Other compared algorithms are in the lower ranks with high differences in results. Manuscript profile
      • Open Access Article

        7 - Modeling and evaluation of RPL routing protocol by colored Petri nets
        Mohammad Pishdar Younes Seifi
        The Internet of Things (IoT) is a novel and widely used idea aimed at connecting objects through communication technologies. The problem of the prior technology adaptation has always been one of the most challenging issues in this area over the years. The Recognition of More
        The Internet of Things (IoT) is a novel and widely used idea aimed at connecting objects through communication technologies. The problem of the prior technology adaptation has always been one of the most challenging issues in this area over the years. The Recognition of Prior Learning (RPL) protocol has been proposed by scientists since 2012 as a solution for IoT routing. This protocol has been utilized by many researchers and hardware companies in the field of the mentioned technology. The present study evaluates RPL behavior from the perspective of the existence of stopping conditions, crossing multiple routes from a special route (loop conditions), and how it reacts to different inputs, while presenting a modular and readable model of this protocol. Manuscript profile